Maximum likelihood Jukes-Cantor triplets: analytic solutions.

نویسندگان

  • Benny Chor
  • Michael D Hendy
  • Sagi Snir
چکیده

Maximum likelihood (ML) is a popular method for inferring a phylogenetic tree of the evolutionary relationship of a set of taxa, from observed homologous aligned genetic sequences of the taxa. Generally, the computation of the ML tree is based on numerical methods, which in a few cases, are known to converge to a local maximum on a tree, which is suboptimal. The extent of this problem is unknown, one approach is to attempt to derive algebraic equations for the likelihood equation and find the maximum points analytically. This approach has so far only been successful in the very simplest cases, of three or four taxa under the Neyman model of evolution of two-state characters. In this paper we extend this approach, for the first time, to four-state characters, the Jukes-Cantor model under a molecular clock, on a tree T on three taxa, a rooted triple. We employ spectral methods (Hadamard conjugation) to express the likelihood function parameterized by the path-length spectrum. Taking partial derivatives, we derive a set of polynomial equations whose simultaneous solution contains all critical points of the likelihood function. Using tools of algebraic geometry (the resultant of two polynomials) in the computer algebra packages (Maple), we are able to find all turning points analytically. We then employ this method on real sequence data and obtain realistic results on the primate-rodents divergence time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Likelihood Equations

Given a model in algebraic statistics and data, the likelihood function is a rational function on a projective variety. Algebraic algorithms are presented for computing all critical points of this function, with the aim of identifying the local maxima in the probability simplex. Applications include models specified by rank conditions on matrices and the Jukes-Cantor models of phylogenetics. Th...

متن کامل

Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood

Maximum likelihood (ML) for phylogenetic inference from sequence data remains a method of choice, but has computational limitations. In particular, it cannot be applied for a global search through all potential trees when the number of taxa is large, and hence a heuristic restriction in the search space is required. In this paper, we derive a quadratic approximation, QAML, to the likelihood fun...

متن کامل

Lower Bounds on Sequence Lengths

In this paper we study the sequence length requirements of distance-based evolutionary tree building algorithms in the Jukes-Cantor model of evolution. By deriving lower bounds on sequence lengths required to recover the evolutionary tree topology correctly , we show that two algorithms, the Short Quartet Method and the Harmonic Greedy Triplets algorithms have optimal sequence length requirements.

متن کامل

Fast Recovery of Evolutionary Trees through Harmonic Greedy Triplets

We give a greedy learning algorithm for reconstructing an evolutionary tree based on a harmonic average on triplets of terminal taxa. After the pairwise distances between terminal taxa are computed, this algorithm runs in quadratic time in the number n of terminal taxa. In the Jukes-Cantor model of evolution generalized for an arbitrary alphabet, the algorithm is mathematically proven to requir...

متن کامل

Reconstructing Phylogenies in Markov Models of Sequence Evolution

The path we follow in this dissertation leads from biomolecular sequences and mathematical sequence evolution models to the design of algorithms with superior efficiency for these models. We study the construction of evolutionary trees from sequences in a probabilistic framework. Our focal problem is that of learning evolutionary tree topologies from the sample sequences they generate in Markov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Molecular biology and evolution

دوره 23 3  شماره 

صفحات  -

تاریخ انتشار 2006